SherbyNet - /page/wikibook/entry.mu

Micron Document

<!DOCTYPE html>

<title>Interpreter (computing)</title>

</head>

Interpreter (computing)

</h1>

</header>

/* start https://en.wikipedia.org/ */

.mw-parser-output .hlist dl,.mw-parser-output .hlist ol,.mw-parser-output .hlist ul{margin:0;padding:0}.mw-parser-output .hlist dd,.mw-parser-output .hlist dt,.mw-parser-output .hlist li{margin:0;display:inline}.mw-parser-output .hlist.inline,.mw-parser-output .hlist.inline dl,.mw-parser-output .hlist.inline ol,.mw-parser-output .hlist.inline ul,.mw-parser-output .hlist dl dl,.mw-parser-output .hlist dl ol,.mw-parser-output .hlist dl ul,.mw-parser-output .hlist ol dl,.mw-parser-output .hlist ol ol,.mw-parser-output .hlist ol ul,.mw-parser-output .hlist ul dl,.mw-parser-output .hlist ul ol,.mw-parser-output .hlist ul ul{display:inline}.mw-parser-output .hlist .mw-empty-li{display:none}.mw-parser-output .hlist dt::after{content:": "}.mw-parser-output .hlist dd::after,.mw-parser-output .hlist li::after{content:" · ";font-weight:bold}.mw-parser-output .hlist dd:last-child::after,.mw-parser-output .hlist dt:last-child::after,.mw-parser-output .hlist li:last-child::after{content:none}.mw-parser-output .hlist dd dd:first-child::before,.mw-parser-output .hlist dd dt:first-child::before,.mw-parser-output .hlist dd li:first-child::before,.mw-parser-output .hlist dt dd:first-child::before,.mw-parser-output .hlist dt dt:first-child::before,.mw-parser-output .hlist dt li:first-child::before,.mw-parser-output .hlist li dd:first-child::before,.mw-parser-output .hlist li dt:first-child::before,.mw-parser-output .hlist li li:first-child::before{content:" (";font-weight:normal}.mw-parser-output .hlist dd dd:last-child::after,.mw-parser-output .hlist dd dt:last-child::after,.mw-parser-output .hlist dd li:last-child::after,.mw-parser-output .hlist dt dd:last-child::after,.mw-parser-output .hlist dt dt:last-child::after,.mw-parser-output .hlist dt li:last-child::after,.mw-parser-output .hlist li dd:last-child::after,.mw-parser-output .hlist li dt:last-child::after,.mw-parser-output .hlist li li:last-child::after{content:")";font-weight:normal}.mw-parser-output .hlist ol{counter-reset:listitem}.mw-parser-output .hlist ol>li{counter-increment:listitem}.mw-parser-output .hlist ol>li::before{content:" "counter(listitem)"\a0 "}.mw-parser-output .hlist dd ol>li:first-child::before,.mw-parser-output .hlist dt ol>li:first-child::before,.mw-parser-output .hlist li ol>li:first-child::before{content:" ("counter(listitem)"\a0 "}

/* end https://en.wikipedia.org/ */

</style><style data-mw-deduplicate="TemplateStyles:r1246091330">

/* start https://en.wikipedia.org/ */

.mw-parser-output .sidebar{width:22em;float:right;clear:right;margin:0.5em 0 1em 1em;background:var(--background-color-neutral-subtle,#f8f9fa);border:1px solid var(--border-color-base,#a2a9b1);padding:0.2em;text-align:center;line-height:1.4em;font-size:88%;border-collapse:collapse;display:table}body.skin-minerva .mw-parser-output .sidebar{display:table!important;float:right!important;margin:0.5em 0 1em 1em!important}.mw-parser-output .sidebar-subgroup{width:100%;margin:0;border-spacing:0}.mw-parser-output .sidebar-left{float:left;clear:left;margin:0.5em 1em 1em 0}.mw-parser-output .sidebar-none{float:none;clear:both;margin:0.5em 1em 1em 0}.mw-parser-output .sidebar-outer-title{padding:0 0.4em 0.2em;font-size:125%;line-height:1.2em;font-weight:bold}.mw-parser-output .sidebar-top-image{padding:0.4em}.mw-parser-output .sidebar-top-caption,.mw-parser-output .sidebar-pretitle-with-top-image,.mw-parser-output .sidebar-caption{padding:0.2em 0.4em 0;line-height:1.2em}.mw-parser-output .sidebar-pretitle{padding:0.4em 0.4em 0;line-height:1.2em}.mw-parser-output .sidebar-title,.mw-parser-output .sidebar-title-with-pretitle{padding:0.2em 0.8em;font-size:145%;line-height:1.2em}.mw-parser-output .sidebar-title-with-pretitle{padding:0.1em 0.4em}.mw-parser-output .sidebar-image{padding:0.2em 0.4em 0.4em}.mw-parser-output .sidebar-heading{padding:0.1em 0.4em}.mw-parser-output .sidebar-content{padding:0 0.5em 0.4em}.mw-parser-output .sidebar-content-with-subgroup{padding:0.1em 0.4em 0.2em}.mw-parser-output .sidebar-above,.mw-parser-output .sidebar-below{padding:0.3em 0.8em;font-weight:bold}.mw-parser-output .sidebar-collapse .sidebar-above,.mw-parser-output .sidebar-collapse .sidebar-below{border-top:1px solid #aaa;border-bottom:1px solid #aaa}.mw-parser-output .sidebar-navbar{text-align:right;font-size:115%;padding:0 0.4em 0.4em}.mw-parser-output .sidebar-list-title{padding:0 0.4em;text-align:left;font-weight:bold;line-height:1.6em;font-size:105%}.mw-parser-output .sidebar-list-title-c{padding:0 0.4em;text-align:center;margin:0 3.3em}@media(max-width:640px){body.mediawiki .mw-parser-output .sidebar{width:100%!important;clear:both;float:none!important;margin-left:0!important;margin-right:0!important}}body.skin--responsive .mw-parser-output .sidebar a>img{max-width:none!important}@media screen{html.skin-theme-clientpref-night .mw-parser-output .sidebar:not(.notheme) .sidebar-list-title,html.skin-theme-clientpref-night .mw-parser-output .sidebar:not(.notheme) .sidebar-title-with-pretitle{background:transparent!important}html.skin-theme-clientpref-night .mw-parser-output .sidebar:not(.notheme) .sidebar-title-with-pretitle a{color:var(--color-progressive)!important}}@media screen and (prefers-color-scheme:dark){html.skin-theme-clientpref-os .mw-parser-output .sidebar:not(.notheme) .sidebar-list-title,html.skin-theme-clientpref-os .mw-parser-output .sidebar:not(.notheme) .sidebar-title-with-pretitle{background:transparent!important}html.skin-theme-clientpref-os .mw-parser-output .sidebar:not(.notheme) .sidebar-title-with-pretitle a{color:var(--color-progressive)!important}}@media print{body.ns-0 .mw-parser-output .sidebar{display:none!important}}

/* end https://en.wikipedia.org/ */

</style><table class="sidebar nomobile nowraplinks"><tbody><tr><th class="sidebar-title"><a href="Execution_(computing)" title="Execution (computing)">Program execution</a></th></tr><tr><th class="sidebar-heading">

General concepts</th></tr><tr><td class="sidebar-content hlist">

<li><a href="Translator_(computing)" title="Translator (computing)">Translation</a>

<ul><li><a href="Compiler" title="Compiler">Compiler</a></li>

<li><a href="Compile_time" title="Compile time">Compile time</a></li>

<li><a href="Optimizing_compiler" title="Optimizing compiler">Optimizing compiler</a></li></ul></li>

<li><a href="Linker_(computing)" title="Linker (computing)"> Linking</a></li>

<li><a href="Execution_(computing)" title="Execution (computing)">Execution</a>

<ul><li><a href="Runtime_system" title="Runtime system">Runtime system</a></li>

<li><a href="Executable" title="Executable">Executable</a></li>

<li><a href="Virtual_machine" title="Virtual machine">Virtual machine</a></li></ul></li>

<li><a href="Intermediate_representation" title="Intermediate representation">Intermediate representation</a> (IR)</li></ul></td>

</tr><tr><th class="sidebar-heading">

Types of code</th></tr><tr><td class="sidebar-content hlist">

<ul><li><a href="Source_code" title="Source code">Source code</a></li>

<li><a href="Object_code" title="Object code">Object code</a></li>

<li><a href="Bytecode" title="Bytecode">Bytecode</a></li>

<li><a href="Machine_code" title="Machine code">Machine code</a></li>

<li><a href="Microcode" title="Microcode">Microcode</a></li></ul></td>

</tr><tr><th class="sidebar-heading">

Compilation strategies</th></tr><tr><td class="sidebar-content hlist">

<ul><li><a href="Ahead-of-time_compilation" title="Ahead-of-time compilation">Ahead-of-time</a> (AOT)</li>

<li><a href="Just-in-time_compilation" title="Just-in-time compilation">Just-in-time</a> (JIT)

<ul><li><a href="Tracing_just-in-time_compilation" title="Tracing just-in-time compilation">Tracing just-in-time</a></li>

<li><a href="Compile_and_go_system" title="Compile and go system">Compile and go system</a></li></ul></li>

<li><a href="Precompilation" class="mw-redirect" title="Precompilation">Precompilation</a></li>

<li><a href="Source-to-source_compiler" title="Source-to-source compiler">Transcompilation</a></li>

<li><a href="Dynamic_recompilation" title="Dynamic recompilation">Recompilation</a></li></ul></td>

</tr><tr><th class="sidebar-heading">

Notable runtimes</th></tr><tr><td class="sidebar-content hlist">

<ul><li><a href="Android_Runtime" title="Android Runtime">Android Runtime</a> (ART)</li>

<li><a href="BEAM_(Erlang_virtual_machine)" title="BEAM (Erlang virtual machine)">BEAM</a> (Erlang)</li>

<li><a href="Common_Language_Runtime" title="Common Language Runtime">Common Language Runtime</a> (CLR) and <a href="Mono_(software)#Code_Execution_Engine" title="Mono (software)">Mono</a></li>

<li><a href="CPython" title="CPython">CPython</a> and <a href="PyPy" title="PyPy">PyPy</a></li>

<li><a href="Crt0" title="Crt0">crt0</a> (<a href="C_(programming_language)" title="C (programming language)">C</a> target-specific initializer)</li>

<li><a href="Java_virtual_machine" title="Java virtual machine">Java virtual machine</a> (JVM)</li>

<li><a href="LuaJIT" title="LuaJIT">LuaJIT</a></li>

<li><a href="Objective-C" title="Objective-C">Objective-C</a> and <a href="Swift_(programming_language)" title="Swift (programming language)">Swift</a>'s</li>

<li><a href="Zend_Engine" title="Zend Engine">Zend Engine</a> (PHP)</li></ul></td>

</tr><tr><th class="sidebar-heading">

Notable compilers & toolchains</th></tr><tr><td class="sidebar-content hlist">

<ul><li><a href="GNU_Compiler_Collection" title="GNU Compiler Collection">GNU Compiler Collection</a> (GCC)</li>

<li><a href="LLVM" title="LLVM">LLVM</a> and <a href="Clang" title="Clang">Clang</a></li>

<li><a href="Glasgow_Haskell_Compiler" title="Glasgow Haskell Compiler">Glasgow Haskell Compiler</a> (GHC)</li></ul></td>

</tr><tr><td class="sidebar-navbar"><style data-mw-deduplicate="TemplateStyles:r1239400231">

/* start https://en.wikipedia.org/ */

.mw-parser-output .navbar{display:inline;font-size:88%;font-weight:normal}.mw-parser-output .navbar-collapse{float:left;text-align:left}.mw-parser-output .navbar-boxtext{word-spacing:0}.mw-parser-output .navbar ul{display:inline-block;white-space:nowrap;line-height:inherit}.mw-parser-output .navbar-brackets::before{margin-right:-0.125em;content:"[ "}.mw-parser-output .navbar-brackets::after{margin-left:-0.125em;content:" ]"}.mw-parser-output .navbar li{word-spacing:-0.125em}.mw-parser-output .navbar a>span,.mw-parser-output .navbar a>abbr{text-decoration:inherit}.mw-parser-output .navbar-mini abbr{font-variant:small-caps;border-bottom:none;text-decoration:none;cursor:inherit}.mw-parser-output .navbar-ct-full{font-size:114%;margin:0 7em}.mw-parser-output .navbar-ct-mini{font-size:114%;margin:0 4em}html.skin-theme-clientpref-night .mw-parser-output .navbar li a abbr{color:var(--color-base)!important}@media(prefers-color-scheme:dark){html.skin-theme-clientpref-os .mw-parser-output .navbar li a abbr{color:var(--color-base)!important}}@media print{.mw-parser-output .navbar{display:none!important}}

/* end https://en.wikipedia.org/ */

</style></td></tr></tbody></table>

In <a href="Computer_science" title="Computer science">computer science</a>, an interpreter is a <a href="Computer_program" title="Computer program">computer program</a> that directly <a href="Execution_(computers)" class="mw-redirect" title="Execution (computers)">executes</a> instructions written in a <a href="Programming_language" title="Programming language">programming</a> or <a href="Scripting_language" title="Scripting language">scripting language</a>, without requiring them previously to have been <a href="Compiler" title="Compiler">compiled</a> into a <a href="Machine_language" class="mw-redirect" title="Machine language">machine language</a> program. An interpreter generally uses one of the following strategies for program execution:

<ol><li><a href="Parse" class="mw-redirect" title="Parse">Parse</a> the <a href="Source_code" title="Source code">source code</a> and perform its behavior directly;</li>

<li><a href="Translator_(computing)" title="Translator (computing)">Translate</a> source code into some efficient <a href="Intermediate_representation" title="Intermediate representation">intermediate representation</a> or <a href="Object_code" title="Object code">object code</a> and immediately execute that;</li>

<li>Explicitly execute stored precompiled <a href="Bytecode" title="Bytecode">bytecode</a><a href="#cite_note-1">[1]</a> made by a <a href="Compiler" title="Compiler">compiler</a> and matched with the interpreter's <a href="Virtual_machine" title="Virtual machine">virtual machine</a>.</li></ol>

Early versions of <a href="Lisp_programming_language" class="mw-redirect" title="Lisp programming language">Lisp programming language</a> and <a href="BASIC_interpreter" title="BASIC interpreter">minicomputer and microcomputer BASIC dialects</a> would be examples of the first type. <a href="Perl" title="Perl">Perl</a>, <a href="Raku_(programming_language)" title="Raku (programming language)">Raku</a>, <a href="Python_(programming_language)" title="Python (programming language)">Python</a>, <a href="MATLAB" title="MATLAB">MATLAB</a>, and <a href="Ruby_(programming_language)" title="Ruby (programming language)">Ruby</a> are examples of the second, while <a href="UCSD_Pascal" title="UCSD Pascal">UCSD Pascal</a> is an example of the third type. Source programs are compiled ahead of time and stored as machine independent code, which is then <a href="Linker_(computing)" title="Linker (computing)">linked</a> at run-time and executed by an interpreter and/or compiler (for <a href="Just-in-time_compilation" title="Just-in-time compilation">JIT</a> systems). Some systems, such as <a href="Smalltalk" title="Smalltalk">Smalltalk</a> and contemporary versions of <a href="BASIC" title="BASIC">BASIC</a> and <a href="Java_(programming_language)" title="Java (programming language)">Java</a>, may also combine two and three types.<a href="#cite_note-2">[2]</a> Interpreters of various types have also been constructed for many languages traditionally associated with compilation, such as <a href="ALGOL" title="ALGOL">Algol</a>, <a href="Fortran" title="Fortran">Fortran</a>, <a href="COBOL" title="COBOL">Cobol</a>, <a href="C_(programming_language)" title="C (programming language)">C</a> and <a href="C%2B%2B" title="C++">C++</a>.

While interpretation and compilation are the two main means by which programming languages are implemented, they are not mutually exclusive, as most interpreting systems also perform some translation work, just like compilers. The terms "<a href="Interpreted_language" class="mw-redirect" title="Interpreted language">interpreted language</a>" or "<a href="Compiled_language" title="Compiled language">compiled language</a>" signify that the canonical implementation of that language is an interpreter or a compiler, respectively. A <a href="High-level_programming_language" title="High-level programming language">high-level language</a> is ideally an <a href="Abstraction_(computer_science)" title="Abstraction (computer science)">abstraction</a> independent of particular implementations.

<div class="mw-heading mw-heading2"><h2 id="History">History</h2></div>

Interpreters were used as early as 1952 to ease programming within the limitations of computers at the time (e.g. a shortage of program storage space, or no native support for floating point numbers). Interpreters were also used to translate between low-level machine languages, allowing code to be written for machines that were still under construction and tested on computers that already existed.<a href="#cite_note-3">[3]</a> The first interpreted high-level language was <a href="Lisp_(programming_language)" title="Lisp (programming language)">Lisp</a>. Lisp was first implemented by <a href="Steve_Russell_(computer_scientist)" title="Steve Russell (computer scientist)">Steve Russell</a> on an <a href="IBM_704" title="IBM 704">IBM 704</a> computer. Russell had read <a href="John_McCarthy_(computer_scientist)" title="John McCarthy (computer scientist)">John McCarthy</a>'s paper, "Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I", and realized (to McCarthy's surprise) that the Lisp eval function could be implemented in machine code.<a href="#cite_note-4">[4]</a> The result was a working Lisp interpreter which could be used to run Lisp programs, or more properly, "evaluate Lisp expressions".

The development of editing interpreters was influenced by the need for interactive computing. In the 1960s, the introduction of time-sharing systems allowed multiple users to access a computer simultaneously, and editing interpreters became essential for managing and modifying code in real-time. The first editing interpreters were likely developed for mainframe computers, where they were used to create and modify programs on the fly. One of the earliest examples of an editing interpreter is the EDT (Editor and Debugger for the TECO) system, which was developed in the late 1960s for the PDP-1 computer. EDT allowed users to edit and debug programs using a combination of commands and macros, paving the way for modern text editors and interactive development environments.

<div class="mw-heading mw-heading2"><h2 id="General_operation">General operation</h2></div>

An interpreter usually consists of a set of known <a href="Command_(computing)" title="Command (computing)">commands</a> it can <a href="Execution_(computing)" title="Execution (computing)">execute</a>, and a list of these commands in the order a programmer wishes to execute them. Each command (also known as an <a href="Instruction_(computer_science)" class="mw-redirect" title="Instruction (computer science)">Instruction</a>) contains the data the programmer wants to mutate, and information on how to mutate the data. For example, an interpreter might read <code>ADD Books, 5</code> and interpret it as a request to add five to the <code>Books</code> <a href="Variable_(computer_science)" title="Variable (computer science)">variable</a>.

Interpreters have a wide variety of instructions which are specialized to perform different tasks, but you will commonly find interpreter instructions for basic <a href="Operation_(mathematics)" title="Operation (mathematics)">mathematical operations</a>, <a href="Branch_(computer_science)" title="Branch (computer science)">branching</a>, and <a href="Memory_management" title="Memory management">memory management</a>, making most interpreters <a href="Turing_completeness" title="Turing completeness">Turing complete</a>. Many interpreters are also closely integrated with a <a href="Garbage_collection_(computer_science)" title="Garbage collection (computer science)">garbage collector</a> and <a href="Debugger" title="Debugger">debugger</a>.

<div class="mw-heading mw-heading2"><h2 id="Compilers_versus_interpreters">Compilers versus interpreters</h2></div>

Programs written in a <a href="High-level_language" class="mw-redirect" title="High-level language">high-level language</a> are either directly executed by some kind of interpreter or converted into <a href="Machine_code" title="Machine code">machine code</a> by a compiler (and <a href="Assembler_(computing)" class="mw-redirect" title="Assembler (computing)">assembler</a> and <a href="Linker_(computing)" title="Linker (computing)">linker</a>) for the <a href="CPU" class="mw-redirect" title="CPU">CPU</a> to execute.

While compilers (and assemblers) generally produce machine code directly executable by computer hardware, they can often (optionally) produce an intermediate form called <a href="Object_code" title="Object code">object code</a>. This is basically the same machine specific code but augmented with a <a href="Symbol_table" title="Symbol table">symbol table</a> with names and tags to make executable blocks (or modules) identifiable and relocatable. Compiled programs will typically use building blocks (functions) kept in a library of such object code modules. A <a href="Linker_(computing)" title="Linker (computing)">linker</a> is used to combine (pre-made) library files with the object file(s) of the application to form a single executable file. The object files that are used to generate an executable file are thus often produced at different times, and sometimes even by different languages (capable of generating the same object format).

A simple interpreter written in a low-level language (e.g. <a href="Assembly_language" title="Assembly language">assembly</a>) may have similar machine code blocks implementing functions of the high-level language stored, and executed when a function's entry in a look up table points to that code. However, an interpreter written in a high-level language typically uses another approach, such as generating and then walking a <a href="Parse_tree" title="Parse tree">parse tree</a>, or by generating and executing intermediate software-defined instructions, or both.

Thus, both compilers and interpreters generally turn source code (text files) into tokens, both may (or may not) generate a parse tree, and both may generate immediate instructions (for a <a href="Stack_machine" title="Stack machine">stack machine</a>, <a href="Three-address_code" title="Three-address code">quadruple code</a>, or by other means). The basic difference is that a compiler system, including a (built in or separate) linker, generates a stand-alone machine code program, while an interpreter system instead performs the actions described by the high-level program.

A compiler can thus make almost all the conversions from source code semantics to the machine level once and for all (i.e. until the program has to be changed) while an interpreter has to do some of this conversion work every time a statement or function is executed. However, in an efficient interpreter, much of the translation work (including analysis of types, and similar) is factored out and done only the first time a program, module, function, or even statement, is run, thus quite akin to how a compiler works. However, a compiled program still runs much faster, under most circumstances, in part because compilers are designed to optimize code, and may be given ample time for this. This is especially true for simpler high-level languages without (many) dynamic data structures, checks, or <a href="Type_checking" class="mw-redirect" title="Type checking">type checking</a>.

In traditional compilation, the executable output of the <a href="Linker_(computing)" title="Linker (computing)">linkers</a> (.exe files or .dll files or a library, see picture) is typically relocatable when run under a general operating system, much like the object code modules are but with the difference that this relocation is done dynamically at run time, i.e. when the program is loaded for execution. On the other hand, compiled and linked programs for small <a href="Embedded_systems" class="mw-redirect" title="Embedded systems">embedded systems</a> are typically statically allocated, often hard coded in a <a href="NOR_flash" class="mw-redirect" title="NOR flash">NOR flash</a> memory, as there is often no secondary storage and no operating system in this sense.

Historically, most interpreter systems have had a self-contained editor built in. This is becoming more common also for compilers (then often called an <a href="Integrated_development_environment" title="Integrated development environment">IDE</a>), although some programmers prefer to use an editor of their choice and run the compiler, linker and other tools manually. Historically, compilers predate interpreters because hardware at that time could not support both the interpreter and interpreted code and the typical batch environment of the time limited the advantages of interpretation.<a href="#cite_note-5">[5]</a>

<div class="mw-heading mw-heading3"><h3 id="Development_cycle">Development cycle</h3></div>

During the <a href="Software_development_cycle" class="mw-redirect" title="Software development cycle">software development cycle</a>, programmers make frequent changes to source code. When using a compiler, each time a change is made to the source code, they must wait for the compiler to translate the altered source files and <a href="Linker_(computing)" title="Linker (computing)">link</a> all of the binary code files together before the program can be executed. The larger the program, the longer the wait. By contrast, a programmer using an interpreter does a lot less waiting, as the interpreter usually just needs to translate the code being worked on to an intermediate representation (or not translate it at all), thus requiring much less time before the changes can be tested. Effects are evident upon saving the source code and reloading the program. Compiled code is generally less readily debugged as editing, compiling, and linking are sequential processes that have to be conducted in the proper sequence with a proper set of commands. For this reason, many compilers also have an executive aid, known as a <a href="Make_(software)" title="Make (software)">Makefile</a> and program. The Makefile lists compiler and linker command lines and program source code files, but might take a simple command line menu input (e.g. "Make 3") which selects the third group (set) of instructions then issues the commands to the compiler, and linker feeding the specified source code files.

<div class="mw-heading mw-heading3"><h3 id="Distribution">Distribution</h3></div>

A <a href="Compiler" title="Compiler">compiler</a> converts source code into binary instruction for a specific processor's architecture, thus making it less <a href="Software_portability" title="Software portability">portable</a>. This conversion is made just once, on the developer's environment, and after that the same binary can be distributed to the user's machines where it can be executed without further translation. A <a href="Cross_compiler" title="Cross compiler">cross compiler</a> can generate binary code for the user machine even if it has a different processor than the machine where the code is compiled.

An interpreted program can be distributed as source code. It needs to be translated in each final machine, which takes more time but makes the program distribution independent of the machine's architecture. However, the portability of interpreted source code is dependent on the target machine actually having a suitable interpreter. If the interpreter needs to be supplied along with the source, the overall installation process is more complex than delivery of a monolithic executable, since the interpreter itself is part of what needs to be installed.

The fact that interpreted code can easily be read and copied by humans can be of concern from the point of view of <a href="Copyright" title="Copyright">copyright</a>. However, various systems of <a href="Encryption" title="Encryption">encryption</a> and <a href="Obfuscation_(software)" title="Obfuscation (software)">obfuscation</a> exist. Delivery of intermediate code, such as bytecode, has a similar effect to obfuscation, but bytecode could be decoded with a <a href="Decompiler" title="Decompiler">decompiler</a> or <a href="Disassembler" title="Disassembler">disassembler</a>.

<div class="mw-heading mw-heading3"><h3 id="Efficiency">Efficiency</h3></div>

The main disadvantage of interpreters is that an interpreted program typically runs more slowly than if it had been <a href="Compiler" title="Compiler">compiled</a>. The difference in speeds could be tiny or great; often an order of magnitude and sometimes more. It generally takes longer to run a program under an interpreter than to run the compiled code but it can take less time to interpret it than the total time required to compile and run it. This is especially important when prototyping and testing code when an edit-interpret-debug cycle can often be much shorter than an edit-compile-run-debug cycle.<a href="#cite_note-FOLDOC-6">[6]</a><a href="#cite_note-7">[7]</a>

Interpreting code is slower than running the compiled code because the interpreter must analyze each <a href="Statement_(computer_science)" title="Statement (computer science)">statement</a> in the program each time it is executed and then perform the desired action, whereas the compiled code just performs the action within a fixed context determined by the compilation. This <a href="Run_time_(program_lifecycle_phase)" class="mw-redirect" title="Run time (program lifecycle phase)">run-time</a> analysis is known as "interpretive overhead". Access to variables is also slower in an interpreter because the mapping of identifiers to storage locations must be done repeatedly at run-time rather than at <a href="Compile_time" title="Compile time">compile time</a>.<a href="#cite_note-FOLDOC-6">[6]</a>

There are various compromises between the development speed when using an interpreter and the execution speed when using a compiler. Some systems (such as some <a href="Lisp_(programming_language)" title="Lisp (programming language)">Lisps</a>) allow interpreted and compiled code to call each other and to share variables. This means that once a routine has been tested and debugged under the interpreter it can be compiled and thus benefit from faster execution while other routines are being developed. Many interpreters do not execute the source code as it stands but convert it into some more compact internal form. Many <a href="BASIC" title="BASIC">BASIC</a> interpreters replace <a href="Keyword_(computer_programming)" class="mw-redirect" title="Keyword (computer programming)">keywords</a> with single <a href="Byte" title="Byte">byte</a> <a href="Token_threading" class="mw-redirect" title="Token threading">tokens</a> which can be used to find the instruction in a <a href="Jump_table" class="mw-redirect" title="Jump table">jump table</a>.<a href="#cite_note-FOLDOC-6">[6]</a> A few interpreters, such as the <a href="PBASIC" title="PBASIC">PBASIC</a> interpreter, achieve even higher levels of program compaction by using a bit-oriented rather than a byte-oriented program memory structure, where commands tokens occupy perhaps 5 bits, nominally "16-bit" constants are stored in a <a href="Variable-length_code" title="Variable-length code">variable-length code</a> requiring 3, 6, 10, or 18 bits, and address operands include a "bit offset". Many BASIC interpreters can store and read back their own tokenized internal representation.

<th>Toy <a href="C_(programming_language)" title="C (programming language)">C</a> expression interpreter

</th></tr>

<tr>

<td><div class="mw-highlight mw-highlight-lang-c mw-content-ltr" dir="ltr"><pre>// data types for abstract syntax tree

enum _kind { kVar, kConst, kSum, kDiff, kMult, kDiv, kPlus, kMinus, kNot };

struct _variable { int *memory; };

struct _constant { int value; };

struct _unaryOperation { struct _node *right; };

struct _binaryOperation { struct _node *left, *right; };

struct _node {

enum _kind kind;

union _expression {

struct _variable variable;

struct _constant constant;

struct _binaryOperation binary;

struct _unaryOperation unary;

} e;

};

// interpreter procedure

int executeIntExpression(const struct _node *n) {

int leftValue, rightValue;

switch (n->kind) {

case kVar: return *n->e.variable.memory;

case kConst: return n->e.constant.value;

case kSum: case kDiff: case kMult: case kDiv:

leftValue = executeIntExpression(n->e.binary.left);

rightValue = executeIntExpression(n->e.binary.right);

case kSum: return leftValue + rightValue;

case kDiff: return leftValue - rightValue;

case kMult: return leftValue * rightValue;

case kDiv: if (rightValue == 0)

exception("division by zero"); // doesn't return

return leftValue / rightValue;

}

case kPlus: case kMinus: case kNot:

rightValue = executeIntExpression(n->e.unary.right);

case kPlus: return + rightValue;

case kMinus: return - rightValue;

case kNot: return ! rightValue;

}

default: exception("internal error: illegal expression kind");

}

}

</pre></div>

</td></tr></tbody></table>

An interpreter might well use the same <a href="Lexical_analysis" title="Lexical analysis">lexical analyzer</a> and <a href="Parser" class="mw-redirect" title="Parser">parser</a> as the compiler and then interpret the resulting <a href="Abstract_syntax_tree" title="Abstract syntax tree">abstract syntax tree</a>. Example data type definitions for the latter, and a toy interpreter for syntax trees obtained from <a href="C_(programming_language)" title="C (programming language)">C</a> expressions are shown in the box.

<div class="mw-heading mw-heading3"><h3 id="Regression">Regression</h3></div>

Interpretation cannot be used as the sole method of execution: even though an interpreter can itself be interpreted and so on, a directly executed program is needed somewhere at the bottom of the stack because the code being interpreted is not, by definition, the same as the machine code that the CPU can execute.<a href="#cite_note-8">[8]</a><a href="#cite_note-9">[9]</a>

<div class="mw-heading mw-heading2"><h2 id="Variations">Variations</h2></div>

<div class="mw-heading mw-heading3"><h3 id="Bytecode_interpreters">Bytecode interpreters</h3></div>

/* start https://en.wikipedia.org/ */

.mw-parser-output .hatnote{font-style:italic}.mw-parser-output div.hatnote{padding-left:1.6em;margin-bottom:0.5em}.mw-parser-output .hatnote i{font-style:normal}.mw-parser-output .hatnote+link+.hatnote{margin-top:-0.5em}@media print{body.ns-0 .mw-parser-output .hatnote{display:none!important}}

/* end https://en.wikipedia.org/ */

</style><div role="note" class="hatnote navigation-not-searchable">Main article: <a href="Bytecode" title="Bytecode">Bytecode</a></div>

There is a spectrum of possibilities between interpreting and compiling, depending on the amount of analysis performed before the program is executed. For example, <a href="Emacs_Lisp" title="Emacs Lisp">Emacs Lisp</a> is compiled to <a href="Bytecode" title="Bytecode">bytecode</a>, which is a highly compressed and optimized representation of the Lisp source, but is not machine code (and therefore not tied to any particular hardware). This "compiled" code is then interpreted by a bytecode interpreter (itself written in <a href="C_(programming_language)" title="C (programming language)">C</a>). The compiled code in this case is machine code for a <a href="Virtual_machine" title="Virtual machine">virtual machine</a>, which is implemented not in hardware, but in the bytecode interpreter. Such compiling interpreters are sometimes also called compreters.<a href="#cite_note-Kühnel_1987_Kleincomputer-10">[10]</a><a href="#cite_note-Heyne_1984_Compreter-11">[11]</a> In a bytecode interpreter each instruction starts with a byte, and therefore bytecode interpreters have up to 256 instructions, although not all may be used. Some bytecodes may take multiple bytes, and may be arbitrarily complicated.

<a href="Control_table" title="Control table">Control tables</a> - that do not necessarily ever need to pass through a compiling phase - dictate appropriate algorithmic <a href="Control_flow" title="Control flow">control flow</a> via customized interpreters in similar fashion to bytecode interpreters.

<div class="mw-heading mw-heading3"><h3 id="Threaded_code_interpreters">Threaded code interpreters</h3></div>

<div role="note" class="hatnote navigation-not-searchable">Main article: <a href="Threaded_code" title="Threaded code">Threaded code</a></div>

Threaded code interpreters are similar to bytecode interpreters but instead of bytes they use pointers. Each "instruction" is a word that points to a function or an instruction sequence, possibly followed by a parameter. The threaded code interpreter either loops fetching instructions and calling the functions they point to, or fetches the first instruction and jumps to it, and every instruction sequence ends with a fetch and jump to the next instruction. Unlike bytecode there is no effective limit on the number of different instructions other than available memory and address space. The classic example of threaded code is the <a href="Forth_(programming_language)" title="Forth (programming language)">Forth</a> code used in <a href="Open_Firmware" title="Open Firmware">Open Firmware</a> systems: the source language is compiled into "F code" (a bytecode), which is then interpreted by a <a href="Virtual_machine" title="Virtual machine">virtual machine</a>.

<div class="mw-heading mw-heading3"><h3 id="Abstract_syntax_tree_interpreters">Abstract syntax tree interpreters</h3></div>

<div role="note" class="hatnote navigation-not-searchable">Main article: <a href="Abstract_syntax_tree" title="Abstract syntax tree">Abstract syntax tree</a></div>

In the spectrum between interpreting and compiling, another approach is to transform the source code into an optimized abstract syntax tree (AST), then execute the program following this tree structure, or use it to generate native code <a href="Just-in-time_compilation" title="Just-in-time compilation">just-in-time</a>.<a href="#cite_note-12">[12]</a> In this approach, each sentence needs to be parsed just once. As an advantage over bytecode, the AST keeps the global program structure and relations between statements (which is lost in a bytecode representation), and when compressed provides a more compact representation.<a href="#cite_note-KistlerFranz1999-13">[13]</a> Thus, using AST has been proposed as a better intermediate format for just-in-time compilers than bytecode. Also, it allows the system to perform better analysis during runtime.

However, for interpreters, an AST causes more overhead than a bytecode interpreter, because of nodes related to syntax performing no useful work, of a less sequential representation (requiring traversal of more pointers) and of overhead visiting the tree.<a href="#cite_note-14">[14]</a>

<div class="mw-heading mw-heading3"><h3 id="Just-in-time_compilation">Just-in-time compilation</h3></div>

<div role="note" class="hatnote navigation-not-searchable">Main article: <a href="Just-in-time_compilation" title="Just-in-time compilation">Just-in-time compilation</a></div>

Further blurring the distinction between interpreters, bytecode interpreters and compilation is just-in-time (JIT) compilation, a technique in which the intermediate representation is compiled to native <a href="Machine_code" title="Machine code">machine code</a> at runtime. This confers the efficiency of running native code, at the cost of startup time and increased memory use when the bytecode or AST is first compiled. The earliest published JIT compiler is generally attributed to work on <a href="Lisp_(programming_language)" title="Lisp (programming language)">LISP</a> by <a href="John_McCarthy_(computer_scientist)" title="John McCarthy (computer scientist)">John McCarthy</a> in 1960.<a href="#cite_note-FOOTNOTEAycock20032._JIT_Compilation_Techniques,_2.1_Genesis,_p._98-15">[15]</a> <a href="Adaptive_optimization" title="Adaptive optimization">Adaptive optimization</a> is a complementary technique in which the interpreter profiles the running program and compiles its most frequently executed parts into native code. The latter technique is a few decades old, appearing in languages such as <a href="Smalltalk" title="Smalltalk">Smalltalk</a> in the 1980s.<a href="#cite_note-16">[16]</a>

Just-in-time compilation has gained mainstream attention amongst language implementers in recent years, with <a href="Java_platform" class="mw-redirect" title="Java platform">Java</a>, the <a href=".NET_Framework" title=".NET Framework">.NET Framework</a>, most modern <a href="JavaScript" title="JavaScript">JavaScript</a> implementations, and <a href="Matlab" class="mw-redirect" title="Matlab">Matlab</a> now including JIT compilers.

<div class="mw-heading mw-heading3"><h3 id="Template_interpreter">Template interpreter</h3></div>

Making the distinction between compilers and interpreters yet again even more vague is a special interpreter design known as a template interpreter. Rather than implement the execution of code by virtue of a large switch statement containing every possible bytecode, while operating on a software stack or a tree walk, a template interpreter maintains a large array of bytecode (or any efficient intermediate representation) mapped directly to corresponding native machine instructions that can be executed on the host hardware as key value pairs (or in more efficient designs, direct addresses to the native instructions),<a href="#cite_note-auto-17">[17]</a><a href="#cite_note-18">[18]</a> known as a "Template". When the particular code segment is executed the interpreter simply loads or jumps to the opcode mapping in the template and directly runs it on the hardware.<a href="#cite_note-19">[19]</a><a href="#cite_note-20">[20]</a> Due to its design, the template interpreter very strongly resembles a just-in-time compiler rather than a traditional interpreter, however it is technically not a JIT due to the fact that it merely translates code from the language into native calls one opcode at a time rather than creating optimized sequences of CPU executable instructions from the entire code segment. Due to the interpreter's simple design of simply passing calls directly to the hardware rather than implementing them directly, it is much faster than every other type, even bytecode interpreters, and to an extent less prone to bugs, but as a tradeoff is more difficult to maintain due to the interpreter having to support translation to multiple different architectures instead of a platform independent virtual machine/stack. To date, the only template interpreter implementations of widely known languages to exist are the interpreter within Java's official reference implementation, the Sun HotSpot Java Virtual Machine,<a href="#cite_note-auto-17">[17]</a> and the Ignition Interpreter in the Google <a href="V8_(JavaScript_engine)" title="V8 (JavaScript engine)">V8</a> JavaScript execution engine.

<div class="mw-heading mw-heading3"><h3 id="Self-interpreter">Self-interpreter</h3></div>

<div role="note" class="hatnote navigation-not-searchable">Main article: <a href="Meta-circular_evaluator" title="Meta-circular evaluator">Meta-circular evaluator</a></div>

A self-interpreter is a <a href="Programming_language" title="Programming language">programming language</a> interpreter written in a programming language which can interpret itself; an example is a <a href="BASIC_programming_language" class="mw-redirect" title="BASIC programming language">BASIC</a> interpreter written in BASIC. Self-interpreters are related to <a href="Self-hosting_(compilers)" title="Self-hosting (compilers)">self-hosting compilers</a>.

If no <a href="Compiler" title="Compiler">compiler</a> exists for the language to be interpreted, creating a self-interpreter requires the implementation of the language in a host language (which may be another programming language or <a href="Assembler_(computing)" class="mw-redirect" title="Assembler (computing)">assembler</a>). By having a first interpreter such as this, the system is <a href="Bootstrapping_(compilers)" title="Bootstrapping (compilers)">bootstrapped</a> and new versions of the interpreter can be developed in the language itself. It was in this way that <a href="Donald_Knuth" title="Donald Knuth">Donald Knuth</a> developed the TANGLE interpreter for the language <a href="WEB" class="mw-redirect" title="WEB">WEB</a> of the de-facto standard <a href="TeX" title="TeX">TeX</a> <a href="Typesetting" title="Typesetting">typesetting system</a>.

Defining a computer language is usually done in relation to an abstract machine (so-called <a href="Operational_semantics" title="Operational semantics">operational semantics</a>) or as a mathematical function (<a href="Denotational_semantics" title="Denotational semantics">denotational semantics</a>). A language may also be defined by an interpreter in which the semantics of the host language is given. The definition of a language by a self-interpreter is not well-founded (it cannot define a language), but a self-interpreter tells a reader about the expressiveness and elegance of a language. It also enables the interpreter to interpret its source code, the first step towards reflective interpreting.

An important design dimension in the implementation of a self-interpreter is whether a feature of the interpreted language is implemented with the same feature in the interpreter's host language. An example is whether a <a href="Closure_(computer_science)" class="mw-redirect" title="Closure (computer science)">closure</a> in a <a href="Lisp_programming_language" class="mw-redirect" title="Lisp programming language">Lisp</a>-like language is implemented using closures in the interpreter language or implemented "manually" with a data structure explicitly storing the environment. The more features implemented by the same feature in the host language, the less control the programmer of the interpreter has; for example, a different behavior for dealing with number overflows cannot be realized if the arithmetic operations are delegated to corresponding operations in the host language.

Some languages such as <a href="Lisp_programming_language" class="mw-redirect" title="Lisp programming language">Lisp</a> and <a href="Prolog" title="Prolog">Prolog</a> have elegant self-interpreters.<a href="#cite_note-21">[21]</a> Much research on self-interpreters (particularly reflective interpreters) has been conducted in the <a href="Scheme_(programming_language)" title="Scheme (programming language)">Scheme programming language</a>, a dialect of Lisp. In general, however, any <a href="Turing_completeness" title="Turing completeness">Turing-complete</a> language allows writing of its own interpreter. Lisp is such a language, because Lisp programs are lists of symbols and other lists. XSLT is such a language, because XSLT programs are written in XML. A sub-domain of <a href="Metaprogramming" title="Metaprogramming">metaprogramming</a> is the writing of <a href="Domain-specific_language" title="Domain-specific language">domain-specific languages</a> (DSLs).

Clive Gifford introduced<a href="#cite_note-22">[22]</a> a measure quality of self-interpreter (the eigenratio), the limit of the ratio between computer time spent running a stack of N self-interpreters and time spent to run a stack of N − 1 self-interpreters as N goes to infinity. This value does not depend on the program being run.

The book <a href="Structure_and_Interpretation_of_Computer_Programs" title="Structure and Interpretation of Computer Programs">Structure and Interpretation of Computer Programs</a> presents examples of <a href="Meta-circular_evaluator" title="Meta-circular evaluator">meta-circular interpretation</a> for Scheme and its dialects. Other examples of languages with a self-interpreter are <a href="Forth_(programming_language)" title="Forth (programming language)">Forth</a> and <a href="Pascal_(programming_language)" title="Pascal (programming language)">Pascal</a>.

<div class="mw-heading mw-heading3"><h3 id="Microcode">Microcode</h3></div>

<div role="note" class="hatnote navigation-not-searchable">Main article: <a href="Microcode" title="Microcode">Microcode</a></div>

Microcode is a very commonly used technique "that imposes an interpreter between the hardware and the architectural level of a computer".<a href="#cite_note-Kent2813-23">[23]</a> As such, the microcode is a layer of hardware-level instructions that implement higher-level <a href="Machine_code" title="Machine code">machine code</a> instructions or internal <a href="State_machine" class="mw-redirect" title="State machine">state machine</a> sequencing in many <a href="Digital_processing" class="mw-redirect" title="Digital processing">digital processing</a> elements. Microcode is used in general-purpose <a href="Central_processing_unit" title="Central processing unit">central processing units</a>, as well as in more specialized processors such as <a href="Microcontroller" title="Microcontroller">microcontrollers</a>, <a href="Digital_signal_processor" title="Digital signal processor">digital signal processors</a>, <a href="Channel_I/O" title="Channel I/O">channel controllers</a>, <a href="Disk_controller" title="Disk controller">disk controllers</a>, <a href="Network_interface_controller" title="Network interface controller">network interface controllers</a>, <a href="Network_processor" title="Network processor">network processors</a>, <a href="Graphics_processing_unit" title="Graphics processing unit">graphics processing units</a>, and in other hardware.

Microcode typically resides in special high-speed memory and translates machine instructions, <a href="State_machine" class="mw-redirect" title="State machine">state machine</a> data or other input into sequences of detailed circuit-level operations. It separates the machine instructions from the underlying <a href="Electronics" title="Electronics">electronics</a> so that instructions can be designed and altered more freely. It also facilitates the building of complex multi-step instructions, while reducing the complexity of computer circuits. Writing microcode is often called microprogramming and the microcode in a particular processor implementation is sometimes called a microprogram.

More extensive microcoding allows small and simple <a href="Microarchitecture" title="Microarchitecture">microarchitectures</a> to <a href="Emulator" title="Emulator">emulate</a> more powerful architectures with wider <a href="Word_length" class="mw-redirect" title="Word length">word length</a>, more <a href="Execution_unit" title="Execution unit">execution units</a> and so on, which is a relatively simple way to achieve software compatibility between different products in a processor family.

<div class="mw-heading mw-heading3"><h3 id="Computer_processor">Computer processor</h3></div>

Even a non microcoding computer processor itself can be considered to be a parsing immediate execution interpreter that is written in a general purpose hardware description language such as <a href="VHDL" title="VHDL">VHDL</a> to create a system that parses the machine code instructions and immediately executes them.

<div class="mw-heading mw-heading2"><h2 id="Applications">Applications</h2></div>

<ul><li>Interpreters are frequently used to execute <a href="Command_language" title="Command language">command languages</a>, and <a href="Glue_language" class="mw-redirect" title="Glue language">glue languages</a> since each operator executed in command language is usually an invocation of a complex routine such as an editor or compiler.</li>

<li><a href="Self-modifying_code" title="Self-modifying code">Self-modifying code</a> can easily be implemented in an interpreted language. This relates to the origins of interpretation in Lisp and <a href="Artificial_intelligence" title="Artificial intelligence">artificial intelligence</a> research.</li>

<li><a href="Virtualization" title="Virtualization">Virtualization</a>. Machine code intended for a hardware architecture can be run using a <a href="Virtual_machine" title="Virtual machine">virtual machine</a>. This is often used when the intended architecture is unavailable, or among other uses, for running multiple copies.</li>

<li><a href="Sandbox_(computer_security)" title="Sandbox (computer security)">Sandboxing</a>: While some types of sandboxes rely on operating system protections, an interpreter or virtual machine is often used. The actual hardware architecture and the originally intended hardware architecture may or may not be the same. This may seem pointless, except that sandboxes are not compelled to actually execute all the instructions the source code it is processing. In particular, it can refuse to execute code that violates any <a href="Computer_security" title="Computer security">security</a> constraints it is operating under.</li>

<li><a href="Emulator" title="Emulator">Emulators</a> for running computer software written for obsolete and unavailable hardware on more modern equipment.</li></ul>

<ul><li><a href="BASIC_interpreter" title="BASIC interpreter">BASIC interpreter</a></li>

<li><a href="Command-line_interpreter" class="mw-redirect" title="Command-line interpreter">Command-line interpreter</a></li>

<li><a href="Compiled_language" title="Compiled language">Compiled language</a></li>

<li><a href="Dynamic_compilation" title="Dynamic compilation">Dynamic compilation</a></li>

<li><a href="Homoiconicity" title="Homoiconicity">Homoiconicity</a></li>

<li><a href="Meta-circular_evaluator" title="Meta-circular evaluator">Meta-circular evaluator</a></li>

<li><a href="Partial_evaluation" title="Partial evaluation">Partial evaluation</a></li>

<li><a href="Read%E2%80%93eval%E2%80%93print_loop" title="Read–eval–print loop">Read–eval–print loop</a></li></ul>

<div class="mw-heading mw-heading2"><h2 id="References">References</h2></div>

/* start https://en.wikipedia.org/ */

.mw-parser-output .reflist{margin-bottom:0.5em;list-style-type:decimal}@media screen{.mw-parser-output .reflist{font-size:90%}}.mw-parser-output .reflist .references{font-size:100%;margin-bottom:0;list-style-type:inherit}.mw-parser-output .reflist-columns-2{column-width:30em}.mw-parser-output .reflist-columns-3{column-width:25em}.mw-parser-output .reflist-columns{margin-top:0.3em}.mw-parser-output .reflist-columns ol{margin-top:0}.mw-parser-output .reflist-columns li{page-break-inside:avoid;break-inside:avoid-column}.mw-parser-output .reflist-upper-alpha{list-style-type:upper-alpha}.mw-parser-output .reflist-upper-roman{list-style-type:upper-roman}.mw-parser-output .reflist-lower-alpha{list-style-type:lower-alpha}.mw-parser-output .reflist-lower-greek{list-style-type:lower-greek}.mw-parser-output .reflist-lower-roman{list-style-type:lower-roman}

/* end https://en.wikipedia.org/ */

</style><div class="reflist">

<li id="cite_note-1"><a href="#cite_ref-1">^</a> In this sense, the <a href="Central_processing_unit" title="Central processing unit">CPU</a> is also an interpreter, of machine instructions.

</li>

<li id="cite_note-2"><a href="#cite_ref-2">^</a> Although this scheme (combining strategy 2 and 3) was used to implement certain BASIC interpreters already in the 1970s, such as the efficient BASIC interpreter of the <a href="ABC_80" title="ABC 80">ABC 80</a>, for instance.

</li>

/* start https://en.wikipedia.org/ */

.mw-parser-output cite.citation{font-style:inherit;word-wrap:break-word}.mw-parser-output .citation q{quotes:"\"""\"""'""'"}.mw-parser-output .citation:target{background-color:rgba(0,127,255,0.133)}.mw-parser-output .id-lock-free.id-lock-free a{background:url("./mw/Lock-green.svg")right 0.1em center/9px no-repeat}.mw-parser-output .id-lock-limited.id-lock-limited a,.mw-parser-output .id-lock-registration.id-lock-registration a{background:url("./mw/Lock-gray-alt-2.svg")right 0.1em center/9px no-repeat}.mw-parser-output .id-lock-subscription.id-lock-subscription a{background:url("./mw/Lock-red-alt-2.svg")right 0.1em center/9px no-repeat}.mw-parser-output .cs1-ws-icon a{background:url("./mw/Wikisource-logo.svg")right 0.1em center/12px no-repeat}body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-free a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-limited a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-registration a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-subscription a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .cs1-ws-icon a{background-size:contain;padding:0 1em 0 0}.mw-parser-output .cs1-code{color:inherit;background:inherit;border:none;padding:inherit}.mw-parser-output .cs1-hidden-error{display:none;color:var(--color-error,#d33)}.mw-parser-output .cs1-visible-error{color:var(--color-error,#d33)}.mw-parser-output .cs1-maint{display:none;color:#085;margin-left:0.3em}.mw-parser-output .cs1-kern-left{padding-left:0.2em}.mw-parser-output .cs1-kern-right{padding-right:0.2em}.mw-parser-output .citation .mw-selflink{font-weight:inherit}@media screen{.mw-parser-output .cs1-format{font-size:95%}html.skin-theme-clientpref-night .mw-parser-output .cs1-maint{color:#18911f}}@media screen and (prefers-color-scheme:dark){html.skin-theme-clientpref-os .mw-parser-output .cs1-maint{color:#18911f}}

/* end https://en.wikipedia.org/ */

</style><cite id="CITEREFBennettPrinzWoods1952" class="citation journal cs1">Bennett, J. M.; Prinz, D. G.; Woods, M. L. (1952). "Interpretative sub-routines". Proceedings of the ACM National Conference, Toronto.</cite>

</li>

<li id="cite_note-4"><a href="#cite_ref-4">^</a> According to what reported by <a href="Paul_Graham_(computer_programmer)" class="mw-redirect" title="Paul Graham (computer programmer)">Paul Graham</a> in <a href="Hackers_%26_Painters" title="Hackers & Painters">Hackers & Painters</a>, p. 185, McCarthy said: "Steve Russell said, look, why don't I program this eval..., and I said to him, ho, ho, you're confusing theory with practice, this eval is intended for reading, not for computing. But he went ahead and did it. That is, he compiled the eval in my paper into <a href="IBM_704" title="IBM 704">IBM 704</a> machine code, fixing <a href="Software_bug" title="Software bug">bug</a>, and then advertised this as a Lisp interpreter, which it certainly was. So at that point Lisp had essentially the form that it has today..."

</li>

<li id="cite_note-5"><a href="#cite_ref-5">^</a> <cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://arstechnica.com/information-technology/2014/11/why-was-the-first-compiler-written-before-the-first-interpreter/">"Why was the first compiler written before the first interpreter?"</a>. <a href="Ars_Technica" title="Ars Technica">Ars Technica</a>. 8 November 2014. Retrieved 9 November 2014.</cite>

</li>

/* start https://en.wikipedia.org/ */

.mw-parser-output .citation{word-wrap:break-word}.mw-parser-output .citation:target{background-color:rgba(0,127,255,0.133)}

/* end https://en.wikipedia.org/ */

</style>This article is based on material taken from <a rel="nofollow" class="external text" href="https://foldoc.org/Interpreter">Interpreter</a> at the <a href="Free_On-line_Dictionary_of_Computing" title="Free On-line Dictionary of Computing">Free On-line Dictionary of Computing</a> prior to 1 November 2008 and incorporated under the "relicensing" terms of the <a href="GNU_Free_Documentation_License" title="GNU Free Documentation License">GFDL</a>, version 1.3 or later.

</li>

<li id="cite_note-7"><a href="#cite_ref-7">^</a> <cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://www.ionos.com/digitalguide/websites/web-development/compilers-vs-interpreters/">"Compilers vs. interpreters: explanation and differences"</a>. IONOS Digital Guide. Retrieved 2022-09-16.</cite>

</li>

<li id="cite_note-8"><a href="#cite_ref-8">^</a> Theodore H. Romer, Dennis Lee, Geoffrey M. Voelker, Alec Wolman, Wayne A. Wong, Jean-Loup Baer, Brian N. Bershad, and Henry M. Levy, <a rel="nofollow" class="external text" href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.41.2582&rep=rep1&type=pdf">The Structure and Performance of Interpreters</a>

</li>

<li id="cite_note-9"><a href="#cite_ref-9">^</a> Terence Parr, Johannes Luber, <a rel="nofollow" class="external text" href="http://www.antlr.org/wiki/display/ANTLR3/The+difference+between+compilers+and+interpreters">The Difference Between Compilers and Interpreters</a> <a rel="nofollow" class="external text" href="https://web.archive.org/web/20140106012828/http://www.antlr.org/wiki/display/ANTLR3/The+difference+between+compilers+and+interpreters">Archived</a> 2014-01-06 at the <a href="Wayback_Machine" title="Wayback Machine">Wayback Machine</a>

</li>

<li id="cite_note-Kühnel_1987_Kleincomputer-10"><a href="#cite_ref-Kühnel_1987_Kleincomputer_10-0">^</a> <cite id="CITEREFKühnel1987" class="citation book cs1 cs1-prop-foreign-lang-source">Kühnel, Claus (1987) [1986]. "4. Kleincomputer - Eigenschaften und Möglichkeiten" [4. Microcomputer - Properties and possibilities]. In Erlekampf, Rainer; Mönk, Hans-Joachim (eds.). Mikroelektronik in der Amateurpraxis [Micro-electronics for the practical amateur] (in German) (3 ed.). Berlin: Militärverlag der Deutschen Demokratischen Republik, Leipzig. p. 222. <a href="ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <bdi>3-327-00357-2</bdi>. 7469332.</cite>

</li>

<li id="cite_note-Heyne_1984_Compreter-11"><a href="#cite_ref-Heyne_1984_Compreter_11-0">^</a> <cite id="CITEREFHeyne1984" class="citation journal cs1 cs1-prop-foreign-lang-source">Heyne, R. (1984). "Basic-Compreter für U880" [BASIC compreter for U880 (Z80)]. radio-fernsehn-elektronik (in German). 1984 (3): 150–152.</cite>

</li>

<li id="cite_note-12"><a href="#cite_ref-12">^</a> <a rel="nofollow" class="external text" href="http://lambda-the-ultimate.org/node/716">AST intermediate representations</a>, Lambda the Ultimate forum

</li>

<li id="cite_note-KistlerFranz1999-13"><a href="#cite_ref-KistlerFranz1999_13-0">^</a> <cite id="CITEREFKistlerFranz1999" class="citation journal cs1">Kistler, Thomas; <a href="Michael_Franz" title="Michael Franz">Franz, Michael</a> (February 1999). <a rel="nofollow" class="external text" href="http://oberon2005.oberoncore.ru/paper/mf1997a.pdf">"A Tree-Based Alternative to Java Byte-Codes"</a> (PDF). International Journal of Parallel Programming. 27 (1): 21–33. <a href="CiteSeerX_(identifier)" class="mw-redirect" title="CiteSeerX (identifier)">CiteSeerX</a> <a rel="nofollow" class="external text" href="https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.87.2257">10.1.1.87.2257</a>. <a href="Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1023%2FA%3A1018740018601">10.1023/A:1018740018601</a>. <a href="ISSN_(identifier)" class="mw-redirect" title="ISSN (identifier)">ISSN</a> <a rel="nofollow" class="external text" href="https://search.worldcat.org/issn/0885-7458">0885-7458</a>. <a href="S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a> <a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:14330985">14330985</a>. Retrieved 2020-12-20.</cite>

</li>

<li id="cite_note-14"><a href="#cite_ref-14">^</a> <a rel="nofollow" class="external text" href="http://webkit.org/blog/189/announcing-squirrelfish/">Surfin' Safari - Blog Archive » Announcing SquirrelFish</a>. Webkit.org (2008-06-02). Retrieved on 2013-08-10.

</li>

<li id="cite_note-FOOTNOTEAycock20032._JIT_Compilation_Techniques,_2.1_Genesis,_p._98-15"><a href="#cite_ref-FOOTNOTEAycock20032._JIT_Compilation_Techniques,_2.1_Genesis,_p._98_15-0">^</a> <a href="#CITEREFAycock2003">Aycock 2003</a>, 2. JIT Compilation Techniques, 2.1 Genesis, p. 98.

</li>

<li id="cite_note-16"><a href="#cite_ref-16">^</a> L. Deutsch, A. Schiffman, <a rel="nofollow" class="external text" href="http://portal.acm.org/citation.cfm?id=800017.800542">Efficient implementation of the Smalltalk-80 system</a>, Proceedings of 11th POPL symposium, 1984.

</li>

<li id="cite_note-auto-17">^ <a href="#cite_ref-auto_17-0">a</a> <a href="#cite_ref-auto_17-1">b</a> <cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://github.com/openjdk/jdk">"openjdk/jdk"</a>. GitHub. 18 November 2021.</cite>

</li>

<li id="cite_note-18"><a href="#cite_ref-18">^</a> <cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://openjdk.java.net/groups/hotspot/docs/RuntimeOverview.html#Interpreter">"HotSpot Runtime Overview"</a>. Openjdk.java.net. Retrieved 2022-08-06.</cite>

</li>

<li id="cite_note-19"><a href="#cite_ref-19">^</a> <cite class="citation news cs1"><a rel="nofollow" class="external text" href="https://metebalci.com/blog/demystifying-the-jvm-jvm-variants-cppinterpreter-and-templateinterpreter/">"Demystifying the JVM: JVM Variants, Cppinterpreter and TemplateInterpreter"</a>. metebalci.com.</cite>

</li>

<li id="cite_note-20"><a href="#cite_ref-20">^</a> <cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://programmersought.com/article/5521858566/">"JVM template interpreter"</a>. ProgrammerSought.</cite>

</li>

<li id="cite_note-21"><a href="#cite_ref-21">^</a> Bondorf, Anders. "<a rel="nofollow" class="external text" href="https://web.archive.org/web/20181112101324/https://pdfs.semanticscholar.org/a089/c5ae66c3311b45de0aaddfa457e4eb821316.pdf">Logimix: A self-applicable partial evaluator for Prolog</a>." Logic Program Synthesis and Transformation. Springer, London, 1993. 214-227.

</li>

<li id="cite_note-22"><a href="#cite_ref-22">^</a> <cite id="CITEREFGifford" class="citation web cs1">Gifford, Clive. <a rel="nofollow" class="external text" href="http://eigenratios.blogspot.com/2006/11/wanted-eigenratios-of-brainfck-self.html">"Eigenratios of Self-Interpreters"</a>. Blogger. Retrieved 10 November 2019.</cite>

</li>

<li id="cite_note-Kent2813-23"><a href="#cite_ref-Kent2813_23-0">^</a> <cite id="CITEREFKentWilliams1993" class="citation book cs1">Kent, Allen; Williams, James G. (April 5, 1993). <a rel="nofollow" class="external text" href="https://books.google.com/books?id=EjWV8J8CQEYC">Encyclopedia of Computer Science and Technology: Volume 28 - Supplement 13</a>. New York: Marcel Dekker, Inc. <a href="ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <bdi>0-8247-2281-7</bdi>. Retrieved Jan 17, 2016.</cite>

</li>

</ol></div></div>

<div class="mw-heading mw-heading2"><h2 id="Sources">Sources</h2></div>

<ul><li><cite id="CITEREFAycock2003" class="citation journal cs1">Aycock, J. (June 2003). "A brief history of just-in-time". ACM Computing Surveys. 35 (2): 97–113. <a href="CiteSeerX_(identifier)" class="mw-redirect" title="CiteSeerX (identifier)">CiteSeerX</a> <a rel="nofollow" class="external text" href="https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.97.3985">10.1.1.97.3985</a>. <a href="Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1145%2F857076.857077">10.1145/857076.857077</a>. <a href="S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a> <a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:15345671">15345671</a>.</cite></li></ul>

<div class="mw-heading mw-heading2"><h2 id="External_links">External links</h2></div>

<ul><li><a rel="nofollow" class="external text" href="http://www.columbia.edu/acis/history/interpreter.html">IBM Card Interpreters</a> page at Columbia University</li>

<li><a rel="nofollow" class="external text" href="https://archive.org/download/TheoreticalFoundationsForPracticaltotallyFunctionalProgramming/33429551_PHD_totalthesis.pdf">Theoretical Foundations For Practical 'Totally Functional Programming'</a> (Chapter 7 especially) Doctoral dissertation tackling the problem of formalising what is an interpreter</li>

<li><a rel="nofollow" class="external text" href="https://www.youtube.com/watch?v=_C5AHaS1mOA">Short animation</a> explaining the key conceptual difference between interpreters and compilers. Archived at <a rel="nofollow" class="external text" href="http://ghostarchive.org/varchive/_C5AHaS1mOA">ghostarchive.org</a> on May 9, 2022.</li></ul>

/* start https://en.wikipedia.org/ */

.mw-parser-output .navbox{box-sizing:border-box;border:1px solid #a2a9b1;width:100%;clear:both;font-size:88%;text-align:center;padding:1px;margin:1em auto 0}.mw-parser-output .navbox .navbox{margin-top:0}.mw-parser-output .navbox+.navbox,.mw-parser-output .navbox+.navbox-styles+.navbox{margin-top:-1px}.mw-parser-output .navbox-inner,.mw-parser-output .navbox-subgroup{width:100%}.mw-parser-output .navbox-group,.mw-parser-output .navbox-title,.mw-parser-output .navbox-abovebelow{padding:0.25em 1em;line-height:1.5em;text-align:center}.mw-parser-output .navbox-group{white-space:nowrap;text-align:right}.mw-parser-output .navbox,.mw-parser-output .navbox-subgroup{background-color:#fdfdfd}.mw-parser-output .navbox-list{line-height:1.5em;border-color:#fdfdfd}.mw-parser-output .navbox-list-with-group{text-align:left;border-left-width:2px;border-left-style:solid}.mw-parser-output tr+tr>.navbox-abovebelow,.mw-parser-output tr+tr>.navbox-group,.mw-parser-output tr+tr>.navbox-image,.mw-parser-output tr+tr>.navbox-list{border-top:2px solid #fdfdfd}.mw-parser-output .navbox-title{background-color:#ccf}.mw-parser-output .navbox-abovebelow,.mw-parser-output .navbox-group,.mw-parser-output .navbox-subgroup .navbox-title{background-color:#ddf}.mw-parser-output .navbox-subgroup .navbox-group,.mw-parser-output .navbox-subgroup .navbox-abovebelow{background-color:#e6e6ff}.mw-parser-output .navbox-even{background-color:#f7f7f7}.mw-parser-output .navbox-odd{background-color:transparent}.mw-parser-output .navbox .hlist td dl,.mw-parser-output .navbox .hlist td ol,.mw-parser-output .navbox .hlist td ul,.mw-parser-output .navbox td.hlist dl,.mw-parser-output .navbox td.hlist ol,.mw-parser-output .navbox td.hlist ul{padding:0.125em 0}.mw-parser-output .navbox .navbar{display:block;font-size:100%}.mw-parser-output .navbox-title .navbar{float:left;text-align:left;margin-right:0.5em}body.skin--responsive .mw-parser-output .navbox-image img{max-width:none!important}@media print{body.ns-0 .mw-parser-output .navbox{display:none!important}}

/* end https://en.wikipedia.org/ */

</style></div><div role="navigation" class="navbox" aria-labelledby="Computer_science1050" style="padding:3px"><table class="nowraplinks hlist mw-collapsible autocollapse navbox-inner" style="border-spacing:0;background:transparent;color:inherit"><tbody><tr><th scope="col" class="navbox-title" colspan="2"><div id="Computer_science1050" style="font-size:114%;margin:0 4em"><a href="Computer_science" title="Computer science">Computer science</a></div></th></tr><tr><td class="navbox-abovebelow" colspan="2"><div>Note: This template roughly follows the 2012 <a href="ACM_Computing_Classification_System" title="ACM Computing Classification System">ACM Computing Classification System</a>.</div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%"><a href="Computer_hardware" title="Computer hardware">Hardware</a></th><td class="navbox-list-with-group navbox-list navbox-odd" style="width:100%;padding:0"><div style="padding:0 0.25em">

<ul><li><a href="Printed_circuit_board" title="Printed circuit board">Printed circuit board</a></li>

<li><a href="Peripheral" title="Peripheral">Peripheral</a></li>

<li><a href="Integrated_circuit" title="Integrated circuit">Integrated circuit</a></li>

<li><a href="Very-large-scale_integration" title="Very-large-scale integration">Very-large-scale integration</a></li>

<li><a href="System_on_a_chip" title="System on a chip">System on a chip</a> (SoC)</li>

<li><a href="Green_computing" title="Green computing">Energy consumption</a> (green computing)</li>

<li><a href="Electronic_design_automation" title="Electronic design automation">Electronic design automation</a></li>

<li><a href="Hardware_acceleration" title="Hardware acceleration">Hardware acceleration</a></li>

<li><a href="Processor_(computing)" title="Processor (computing)">Processor</a></li>

</div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%">Computer systems organization</th><td class="navbox-list-with-group navbox-list navbox-even" style="width:100%;padding:0"><div style="padding:0 0.25em">

<ul><li><a href="Computer_architecture" title="Computer architecture">Computer architecture</a></li>

<li><a href="Computational_complexity" title="Computational complexity">Computational complexity</a></li>

<li><a href="Dependability" title="Dependability">Dependability</a></li>

<li><a href="Embedded_system" title="Embedded system">Embedded system</a></li>

<li><a href="Real-time_computing" title="Real-time computing">Real-time computing</a></li>

<li><a href="Cyber-physical_system" title="Cyber-physical system">Cyber-physical system</a></li>

<li><a href="Fault_tolerance" title="Fault tolerance">Fault tolerance</a></li>

<li><a href="Wireless_sensor_network" title="Wireless sensor network">Wireless sensor network</a></li></ul>

</div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%"><a href="Computer_network" title="Computer network">Networks</a></th><td class="navbox-list-with-group navbox-list navbox-odd" style="width:100%;padding:0"><div style="padding:0 0.25em">

<ul><li><a href="Network_architecture" title="Network architecture">Network architecture</a></li>

<li><a href="Communication_protocol" title="Communication protocol">Network protocol</a></li>

<li><a href="Networking_hardware" title="Networking hardware">Network components</a></li>

<li><a href="Network_scheduler" title="Network scheduler">Network scheduler</a></li>

<li><a href="Network_performance" title="Network performance">Network performance evaluation</a></li>

<li><a href="Network_service" title="Network service">Network service</a></li></ul>

</div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%">Software organization</th><td class="navbox-list-with-group navbox-list navbox-even" style="width:100%;padding:0"><div style="padding:0 0.25em">

<ul>

<li><a href="Middleware" title="Middleware">Middleware</a></li>

<li><a href="Virtual_machine" title="Virtual machine">Virtual machine</a></li>

<li><a href="Operating_system" title="Operating system">Operating system</a></li>

<li><a href="Software_quality" title="Software quality">Software quality</a></li></ul>

</div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%"><a href="Programming_language_theory" title="Programming language theory">Software notations</a> and <a href="Programming_tool" title="Programming tool">tools</a></th><td class="navbox-list-with-group navbox-list navbox-odd" style="width:100%;padding:0"><div style="padding:0 0.25em">

<ul><li><a href="Programming_paradigm" title="Programming paradigm">Programming paradigm</a></li>

<li><a href="Programming_language" title="Programming language">Programming language</a></li>

<li><a href="Compiler_construction" class="mw-redirect" title="Compiler construction">Compiler</a></li>

<li><a href="Domain-specific_language" title="Domain-specific language">Domain-specific language</a></li>

<li><a href="Modeling_language" title="Modeling language">Modeling language</a></li>

<li><a href="Software_framework" title="Software framework">Software framework</a></li>

<li><a href="Integrated_development_environment" title="Integrated development environment">Integrated development environment</a></li>

<li><a href="Software_configuration_management" title="Software configuration management">Software configuration management</a></li>

<li><a href="Library_(computing)" title="Library (computing)">Software library</a></li>

<li><a href="Software_repository" title="Software repository">Software repository</a></li></ul>

</div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%"><a href="Software_development" title="Software development">Software development</a></th><td class="navbox-list-with-group navbox-list navbox-even" style="width:100%;padding:0"><div style="padding:0 0.25em">

<ul><li><a href="Control_flow" title="Control flow">Control variable</a></li>

<li><a href="Software_development_process" title="Software development process">Software development process</a></li>

<li><a href="Requirements_analysis" title="Requirements analysis">Requirements analysis</a></li>

<li><a href="Software_design" title="Software design">Software design</a></li>

<li><a href="Software_construction" title="Software construction">Software construction</a></li>

<li><a href="Software_deployment" title="Software deployment">Software deployment</a></li>

<li><a href="Software_engineering" title="Software engineering">Software engineering</a></li>

<li><a href="Software_maintenance" title="Software maintenance">Software maintenance</a></li>

<li><a href="Programming_team" title="Programming team">Programming team</a></li>

<li><a href="Open-source_software" title="Open-source software">Open-source model</a></li></ul>

</div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%"><a href="Theory_of_computation" title="Theory of computation">Theory of computation</a></th><td class="navbox-list-with-group navbox-list navbox-odd" style="width:100%;padding:0"><div style="padding:0 0.25em">

<ul><li><a href="Model_of_computation" title="Model of computation">Model of computation</a>

<ul><li><a href="Stochastic_computing" title="Stochastic computing">Stochastic</a></li></ul></li>

<li><a href="Formal_language" title="Formal language">Formal language</a></li>

<li><a href="Automata_theory" title="Automata theory">Automata theory</a></li>

<li><a href="Computability_theory" title="Computability theory">Computability theory</a></li>

<li><a href="Computational_complexity_theory" title="Computational complexity theory">Computational complexity theory</a></li>

<li><a href="Logic_in_computer_science" title="Logic in computer science">Logic</a></li>

<li><a href="Semantics_(computer_science)" title="Semantics (computer science)">Semantics</a></li></ul>

</div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%"><a href="Algorithm" title="Algorithm">Algorithms</a></th><td class="navbox-list-with-group navbox-list navbox-even" style="width:100%;padding:0"><div style="padding:0 0.25em">

<ul><li><a href="Algorithm_design" class="mw-redirect" title="Algorithm design">Algorithm design</a></li>

<li><a href="Analysis_of_algorithms" title="Analysis of algorithms">Analysis of algorithms</a></li>

<li><a href="Algorithmic_efficiency" title="Algorithmic efficiency">Algorithmic efficiency</a></li>

<li><a href="Randomized_algorithm" title="Randomized algorithm">Randomized algorithm</a></li>

<li><a href="Computational_geometry" title="Computational geometry">Computational geometry</a></li></ul>

</div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%">Mathematics of <a href="Computing" title="Computing">computing</a></th><td class="navbox-list-with-group navbox-list navbox-odd" style="width:100%;padding:0"><div style="padding:0 0.25em">

<ul><li><a href="Discrete_mathematics" title="Discrete mathematics">Discrete mathematics</a></li>

<li><a href="Probability" title="Probability">Probability</a></li>

<li><a href="Statistics" title="Statistics">Statistics</a></li>

<li><a href="Mathematical_software" title="Mathematical software">Mathematical software</a></li>

<li><a href="Information_theory" title="Information theory">Information theory</a></li>

<li><a href="Mathematical_analysis" title="Mathematical analysis">Mathematical analysis</a></li>

<li><a href="Numerical_analysis" title="Numerical analysis">Numerical analysis</a></li>

<li><a href="Theoretical_computer_science" title="Theoretical computer science">Theoretical computer science</a></li></ul>

</div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%"><a href="Information_system" title="Information system">Information systems</a></th><td class="navbox-list-with-group navbox-list navbox-even" style="width:100%;padding:0"><div style="padding:0 0.25em">

<ul><li><a href="Database" title="Database">Database management system</a></li>

<li><a href="Computer_data_storage" title="Computer data storage">Information storage systems</a></li>

<li><a href="Enterprise_information_system" title="Enterprise information system">Enterprise information system</a></li>

<li><a href="Social_software" title="Social software">Social information systems</a></li>

<li><a href="Geographic_information_system" title="Geographic information system">Geographic information system</a></li>

<li><a href="Decision_support_system" title="Decision support system">Decision support system</a></li>

<li><a href="Industrial_process_control" title="Industrial process control">Process control system</a></li>

<li><a href="Multimedia_database" title="Multimedia database">Multimedia information system</a></li>

<li><a href="Data_mining" title="Data mining">Data mining</a></li>

<li><a href="Digital_library" title="Digital library">Digital library</a></li>

<li><a href="Computing_platform" title="Computing platform">Computing platform</a></li>

<li><a href="Digital_marketing" title="Digital marketing">Digital marketing</a></li>

<li><a href="World_Wide_Web" title="World Wide Web">World Wide Web</a></li>

<li><a href="Information_retrieval" title="Information retrieval">Information retrieval</a></li></ul>

</div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%"><a href="Computer_security" title="Computer security">Security</a></th><td class="navbox-list-with-group navbox-list navbox-odd" style="width:100%;padding:0"><div style="padding:0 0.25em">

<ul><li><a href="Cryptography" title="Cryptography">Cryptography</a></li>

<li><a href="Formal_methods" title="Formal methods">Formal methods</a></li>

<li><a href="Security_hacker" title="Security hacker">Security hacker</a></li>

<li><a href="Security_service_(telecommunication)" title="Security service (telecommunication)">Security services</a></li>

<li><a href="Intrusion_detection_system" title="Intrusion detection system">Intrusion detection system</a></li>

<li><a href="Hardware_security" title="Hardware security">Hardware security</a></li>

<li><a href="Network_security" title="Network security">Network security</a></li>

<li><a href="Information_security" title="Information security">Information security</a></li>

<li><a href="Application_security" title="Application security">Application security</a></li></ul>

</div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%"><a class="external text external" href="https://en.wikipedia.org/wiki/Human-centered_computing">Human–centered computing</a></th><td class="navbox-list-with-group navbox-list navbox-even" style="width:100%;padding:0"><div style="padding:0 0.25em">

<ul><li><a href="Interaction_design" title="Interaction design">Interaction design</a></li>

<li><a href="Augmented_reality" title="Augmented reality">Augmented reality</a></li>

<li><a href="Virtual_reality" title="Virtual reality">Virtual reality</a></li>

<li><a href="Social_computing" title="Social computing">Social computing</a></li>

<li><a href="Ubiquitous_computing" title="Ubiquitous computing">Ubiquitous computing</a></li>

<li><a href="Visualization_(graphics)" title="Visualization (graphics)">Visualization</a></li>

<li><a href="Computer_accessibility" title="Computer accessibility">Accessibility</a></li>

<li><a href="Human%E2%80%93computer_interaction" title="Human–computer interaction">Human–computer interaction</a></li>

<li><a href="Mobile_computing" title="Mobile computing">Mobile computing</a></li></ul>

</div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%"><a href="Concurrency_(computer_science)" title="Concurrency (computer science)">Concurrency</a></th><td class="navbox-list-with-group navbox-list navbox-odd" style="width:100%;padding:0"><div style="padding:0 0.25em">

<ul><li><a href="Concurrent_computing" title="Concurrent computing">Concurrent computing</a></li>

<li><a href="Parallel_computing" title="Parallel computing">Parallel computing</a></li>

<li><a href="Distributed_computing" title="Distributed computing">Distributed computing</a></li>

<li><a href="Multithreading_(computer_architecture)" title="Multithreading (computer architecture)">Multithreading</a></li>

<li><a href="Multiprocessing" title="Multiprocessing">Multiprocessing</a></li></ul>

</div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%"><a href="Artificial_intelligence" title="Artificial intelligence">Artificial intelligence</a></th><td class="navbox-list-with-group navbox-list navbox-even" style="width:100%;padding:0"><div style="padding:0 0.25em">

<ul><li><a href="Natural_language_processing" title="Natural language processing">Natural language processing</a></li>

<li><a href="Knowledge_representation_and_reasoning" title="Knowledge representation and reasoning">Knowledge representation and reasoning</a></li>

<li><a href="Computer_vision" title="Computer vision">Computer vision</a></li>

<li><a href="Automated_planning_and_scheduling" title="Automated planning and scheduling">Automated planning and scheduling</a></li>

<li><a href="Mathematical_optimization" title="Mathematical optimization">Search methodology</a></li>

<li><a href="Control_theory" title="Control theory">Control method</a></li>

<li><a href="Philosophy_of_artificial_intelligence" title="Philosophy of artificial intelligence">Philosophy of artificial intelligence</a></li>

<li><a href="Distributed_artificial_intelligence" title="Distributed artificial intelligence">Distributed artificial intelligence</a></li></ul>

</div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%"><a href="Machine_learning" title="Machine learning">Machine learning</a></th><td class="navbox-list-with-group navbox-list navbox-odd" style="width:100%;padding:0"><div style="padding:0 0.25em">

<ul><li><a href="Supervised_learning" title="Supervised learning">Supervised learning</a></li>

<li><a href="Unsupervised_learning" title="Unsupervised learning">Unsupervised learning</a></li>

<li><a href="Reinforcement_learning" title="Reinforcement learning">Reinforcement learning</a></li>

<li><a href="Multi-task_learning" title="Multi-task learning">Multi-task learning</a></li>

<li><a href="Cross-validation_(statistics)" title="Cross-validation (statistics)">Cross-validation</a></li></ul>

</div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%"><a href="Computer_graphics" title="Computer graphics">Graphics</a></th><td class="navbox-list-with-group navbox-list navbox-even" style="width:100%;padding:0"><div style="padding:0 0.25em">

<ul><li><a href="Computer_animation" title="Computer animation">Animation</a></li>

<li><a href="Rendering_(computer_graphics)" title="Rendering (computer graphics)">Rendering</a></li>

<li><a href="Photograph_manipulation" title="Photograph manipulation">Photograph manipulation</a></li>

<li><a href="Graphics_processing_unit" title="Graphics processing unit">Graphics processing unit</a></li>

<li><a href="Image_compression" title="Image compression">Image compression</a></li>

<li><a href="Solid_modeling" title="Solid modeling">Solid modeling</a></li></ul>

</div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%">Applied computing</th><td class="navbox-list-with-group navbox-list navbox-odd" style="width:100%;padding:0"><div style="padding:0 0.25em">

<ul><li><a href="Quantum_computing" title="Quantum computing">Quantum computing</a></li>

<li><a href="E-commerce" title="E-commerce">E-commerce</a></li>

<li><a href="Enterprise_software" title="Enterprise software">Enterprise software</a></li>

<li><a href="Computational_mathematics" title="Computational mathematics">Computational mathematics</a></li>

<li><a href="Computational_physics" title="Computational physics">Computational physics</a></li>

<li><a href="Computational_chemistry" title="Computational chemistry">Computational chemistry</a></li>

<li><a href="Computational_biology" title="Computational biology">Computational biology</a></li>

<li><a href="Computational_social_science" title="Computational social science">Computational social science</a></li>

<li><a href="Computational_engineering" title="Computational engineering">Computational engineering</a></li>

<li>Differentiable computing</li>

<li><a href="Health_informatics" title="Health informatics">Computational healthcare</a></li>

<li><a href="Digital_art" title="Digital art">Digital art</a></li>

<li><a href="Electronic_publishing" title="Electronic publishing">Electronic publishing</a></li>

<li><a href="Cyberwarfare" title="Cyberwarfare">Cyberwarfare</a></li>

<li><a href="Electronic_voting" title="Electronic voting">Electronic voting</a></li>

<li><a href="Video_game" title="Video game">Video games</a></li>

<li><a href="Word_processor" title="Word processor">Word processing</a></li>

<li><a href="Operations_research" title="Operations research">Operations research</a></li>

<li><a href="Educational_technology" title="Educational technology">Educational technology</a></li>

<li><a href="Document_management_system" title="Document management system">Document management</a></li></ul>

</div></td></tr><tr><td class="navbox-abovebelow" colspan="2"><div>

<ul><li> Category</li>

<li> <a href="Outline_of_computer_science" title="Outline of computer science">Outline</a></li>

<li> Glossaries</li></ul>

</div></td></tr></tbody></table></div>

<div class="navbox-styles"></div><div role="navigation" class="navbox authority-control" aria-labelledby="Authority_control_databases_frameless&#124;text-top&#124;10px&#124;alt=Edit_this_at_Wikidata&#124;link=https&#58;//www.wikidata.org/wiki/Q183065#identifiers&#124;class=noprint&#124;Edit_this_at_Wikidata896" style="padding:3px"><table class="nowraplinks hlist mw-collapsible autocollapse navbox-inner" style="border-spacing:0;background:transparent;color:inherit"><tbody><tr><th scope="col" class="navbox-title" colspan="2"><div id="Authority_control_databases_frameless&#124;text-top&#124;10px&#124;alt=Edit_this_at_Wikidata&#124;link=https&#58;//www.wikidata.org/wiki/Q183065#identifiers&#124;class=noprint&#124;Edit_this_at_Wikidata896" style="font-size:114%;margin:0 4em">Authority control databases </div></th></tr><tr><th scope="row" class="navbox-group" style="width:1%">National</th><td class="navbox-list-with-group navbox-list navbox-odd" style="width:100%;padding:0"><div style="padding:0 0.25em"><ul><li><a rel="nofollow" class="external text" href="https://d-nb.info/gnd/4162129-3">Germany</a></li><li><a rel="nofollow" class="external text" href="https://id.loc.gov/authorities/sh85067496">United States</a></li><li><a rel="nofollow" class="external text" href="https://catalogue.bnf.fr/ark:/12148/cb11938287v">France</a></li><li><a rel="nofollow" class="external text" href="https://data.bnf.fr/ark:/12148/cb11938287v">BnF data</a></li><li><a rel="nofollow" class="external text" href="https://www.nli.org.il/en/authorities/987007558186505171">Israel</a></li></ul></div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%">Other</th><td class="navbox-list-with-group navbox-list navbox-even" style="width:100%;padding:0"><div style="padding:0 0.25em"><ul><li><a rel="nofollow" class="external text" href="https://lux.collections.yale.edu/view/concept/b2a61965-5425-4fe2-b848-449d436aa7de">Yale LUX</a></li></ul></div></td></tr></tbody></table></div></div><div><div class="zim-footer">

This article is issued from <a class="external text" title="Last edited on 2025-07-21" href="https://en.wikipedia.org/wiki/?title=Interpreter_(computing)&oldid=1301823270">Wikipedia</a>. The text is available under <a class="external text" href="https://creativecommons.org/licenses/by-sa/4.0/deed.en">Creative Commons Attribution-Share Alike 4.0</a> unless otherwise noted. Additional terms may apply for the media files.

</div>

</div></div>

</div>

</main>

</div>

</body></html>